FUZZY UNIVERSAL HASHING AND APPROXIMATE AUTHENTICATION

Fuzzy Universal Hashing and Approximate Authentication

Universal Hashing and Authentication Codes

Universal Hashing and Multiple Authentication

In this paper, we study unconditionally secure codes that provide authentication without secrecy. Our point of view is the univcrsal hashing approach pioneered by Wegman and Carter in 1981. We first compare several recent universal-hashing based constructions for mthenticatmion codes. Then we gencralize the theory of universal hashing in order t,o accommodate the situation where we would like t...

UMAC: Message Authentication Code using Universal Hashing

Status of This Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Abstract This specification describes how to generate an authentication tag using the UMAC message authentication algorithm. UMAC is designed to be very fast to compute in software on contemporary uniprocessors. Measured spe...

Universal Hashing and Perfect Hashing

Each of the key values x comes from a universe U , i.e. x ∈ U . In this document, we assume U = {1, 2, . . . N}. Observe that the set S is a dynamic set. Each of the Insert and Delete operations may modify the set. Hence the size of the set S changes with each operation. We bound the maximum size of the set to n (n << N). What are the data structures that can be used to store the set S? One opt...